Optimal switching policies using coarse timesteppers

نویسندگان

  • Antonios Armaou
  • Ioannis G. Kevrekidis
چکیده

We present a computer-assisted approach to approximating coarse optimal switching policies for systems described by microscopic/stochastic evolution rules. The “coarse timestepper” constitutes a bridge between the underlying kinetic Monte Carlo simulation and traditional, continuum numerical optimization techniques formulated in discrete time. The approach is illustrated through a simplified kinetic Monte Carlo simulation of NO reduction on a Pt catalyst: a switch between two coexisting stable steady states is implemented by minimal manipulation of a system parameter.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

System Level Numerical Analysis of a Monte Carlo Simulation of the E. Coli Chemotaxis

Over the past few years it has been demonstrated that “coarse timesteppers” establish a link between traditional numerical analysis and microscopic/ stochastic simulation. The underlying assumption of the associated “lift-run-restrict-estimate” procedure is that macroscopic models exist and close in terms of a few governing moments of microscopically evolving distributions, but they are unavail...

متن کامل

Spatially distributed stochastic systems: Equation-free and equation-assisted preconditioned computations.

Spatially distributed problems are often approximately modeled in terms of partial differential equations (PDEs) for appropriate coarse-grained quantities (e.g., concentrations). The derivation of accurate such PDEs starting from finer scale, atomistic models, and using suitable averaging is often a challenging task; approximate PDEs are typically obtained through mathematical closure procedure...

متن کامل

Delay-Optimal Scheduling for Queueing Systems with Switching Overhead

We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to serve a different set of queues. The capacity loss due to this switching overhead can be significant in many emerging applications, and needs to be explicitly a...

متن کامل

Optimality of Index Policies for Stochastic Scheduling with Switching Penalties

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that deenes an...

متن کامل

Optimality of Index Policies for Stochastic Scheduling with Switching Penalties Author(s):

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003